On the allocation of network service curves for bandwidth/delay-decoupled scheduling disciplines
نویسنده
چکیده
been and still is an important research area. In particular, it is important to ensure strict (deterministic) guarantees for highly time-sensitive data flows. In this paper, we discuss how to efficiently allocate service curves for deter-ministically guaranteed services. We focus on bandwidth/ delay-decoupled service disciplines and their respective service curves due to their distinct advantages over purely rate-based schedulers. Resource-optimal network service curves for deterministic service flows scheduled by band-width/delay-decoupled service disciplines are derived and their performance is discussed by numerical examples.
منابع مشابه
Optimal Network Service Curves under Bandwidth-Delay Decoupling Author:
Providing Quality of Service (QoS) guarantees to data flows in packet-switched networks like the Internet has been and still is an important research area. In particular, it is important to ensure strict (deterministic) guarantees for highly time-sensitive data flows. In this work, we derive optimal network service curves for deterministic service flows which are scheduled by bandwidth-delay de...
متن کاملDynamic Bandwidth Allocation and Quality of Service Guarantees in Passive Optical Networks
This paper gives an overview of current work and research conducted on passive optical networks, namely on dynamic bandwidth allocation and providing quality of service guarantees. The main areas of interest for investigating dynamic bandwidth allocation are grant sizing, grant scheduling and optical network unit queue scheduling. Regarding quality of service parameters bandwidth, delay and jit...
متن کاملA Packet Scheduling Approach to QoS Support in Multihop Wireless Networks
Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in the bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in mult...
متن کاملTraffic with Fair Service Curve
Packet Fair Queueing (PFQ) algorithms are the most popular and well studied scheduling algorithms for integrated services networks for two reasons: (1) With reservation, they can provide per-flow end-to-end delay guarantees for real-time traffic flows. (2) Without reservation, they can provide protection among competing best-effort flows while allowing dynamic bandwidth sharing. However, PFQ al...
متن کاملJoint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks
Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002